Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
+(X, 0) → X
+(X, s(Y)) → s(+(X, Y))
double(X) → +(X, X)
f(0, s(0), X) → f(X, double(X), X)
g(X, Y) → X
g(X, Y) → Y
Q is empty.
↳ QTRS
Q restricted rewrite system:
The TRS R consists of the following rules:
+(X, 0) → X
+(X, s(Y)) → s(+(X, Y))
double(X) → +(X, X)
f(0, s(0), X) → f(X, double(X), X)
g(X, Y) → X
g(X, Y) → Y
Q is empty.